Compilation and Simpliication of Temporal Integrity Constraints

The paper presents a novel compilation scheme for temporal integrity constraints and deductive rules expressed in an interval-based rst-order temporal logic. Compilation builds a dependence graph with simpliied forms of the constraints and rules. This permits the compile-time simpliication of the formulae that have to be veriied at run-time, as well as the precomputation of potential implicit updates. Simpliication takes place with respect to the anticipated types of updates. We show how simpliied forms can be obtained with respect to transactions made up of arbitrary sequences of basic updates. Additional optimization steps exploit the organization of simpliied forms in dependence graphs.